Deciding Ellipticity by Quantifier Elimination
نویسندگان
چکیده
We show how ellipticity of partial differential systems in the sense of Douglis and Nirenberg can be decided algorithmically by quantifier elimination on real closed fields. A concrete implementation based on MuPAD and Redlog is presented.
منابع مشابه
Real Quantifier Elimination in the RegularChains Library
Quantifier elimination (QE) over real closed fields has found numerous applications. Cylindrical algebraic decomposition (CAD) is one of the main tools for handling quantifier elimination of nonlinear input formulas. Despite of its worst case doubly exponential complexity, CAD-based quantifier elimination remains interesting for handling general quantified formulas and producing simple quantifi...
متن کاملQuantifier elimination for the theory of algebraically closed valued fields with analytic structure
The theory of algebraically closed non-Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper and which has far reaching consequences in the geometry of definable sets. This method of proving quantifier ...
متن کاملQuantifier Elimination in Term Algebras The Case of Finite Languages
We give a quantifier elimination procedure for term algebras over suitably expanded finite first-order languages. Our expansion is purely functional. Our method works by substituting finitely many parametric test terms. This allows us to obtain in addition sample solutions for an outermost existential quantifier block. The existence of our method implies that the considered quantifier eliminati...
متن کاملVerifying Mixed Real-Integer Quantifier Elimination
We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a work by Weispfenning. To this end we provide two verified quantifier elimination procedures: for Presburger arithmitics and for linear real arithmetics.
متن کاملQuantifier Elimination for Neocompact Sets
We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003